The Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Space
نویسندگان
چکیده
We present a subgradient extragradient method for solving variational inequalities in Hilbert space. In addition, we propose a modified version of our algorithm that finds a solution of a variational inequality which is also a fixed point of a given nonexpansive mapping. We establish weak convergence theorems for both algorithms.
منابع مشابه
Strong Convergence of the Halpern Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Spaces
In this paper, we combine the subgradient extragradient method with the Halpern method for finding a solution of a variational inequality involving a monotone Lipschitz mapping in Banach spaces. By using the generalized projection operator and the Lyapunov functional introduced by Alber, we prove a strong convergence theorem. We also consider the problem of finding a common element of the set o...
متن کاملA modified subgradient extragradient method for solving monotone variational inequalities
In the setting of Hilbert space, a modified subgradient extragradient method is proposed for solving Lipschitz-continuous and monotone variational inequalities defined on a level set of a convex function. Our iterative process is relaxed and self-adaptive, that is, in each iteration, calculating two metric projections onto some half-spaces containing the domain is involved only and the step siz...
متن کاملStrong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
We study two projection algorithms for solving the Variational Inequality Problem (VIP) in Hilbert space. One algorithm is a modi ed subgradient extragradient method in which an additional projection onto the intersection of two half-spaces is employed. Another algorithm is based on the shrinking projection method. We establish strong convergence theorems for both algorithms.
متن کاملAn Algorithm for Solving Triple Hierarchical Pseudomonotone Variational Inequalities
In this paper, we introduce and analyze a hybrid steepest-descent extragradient algorithm for solving triple hierarchical pseudomonotone variational inequalities in a real Hilbert space. The proposed algorithm is based on Korpelevich’s extragradient method, Mann’s iteration method, hybrid steepest-descent method and Halpern’s iteration method. Under mild conditions, the strong convergence of th...
متن کاملProjected subgradient method for non - Lipschitz set - valued mixed variational inequalities
A projected subgradient method for solving a class of set-valued mixed variational inequalities (SMVIs) is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of optimization theory and applications
دوره 148 2 شماره
صفحات -
تاریخ انتشار 2011